Limited-Time Lookahead Diagnosability of Rectangular Hybrid Automata
نویسندگان
چکیده
This paper investigates the diagnosability of Rectangular Hybrid Automata used for modeling a class of hybrid systems. First, a generalized definition of Limited-Time Lookahead diagnosability of timed languages, for multiple failure modes, is proposed. Then, we provide a systematic approach, for checking the LTLa diagnosability of systems modeled with Rectangular Hybrid Automata, and verifying some realistic assumptions. A practical example is considered throughout the paper for illustration purposes.
منابع مشابه
Diagnosability Verification for Hybrid Automata
We define a notion of diagnosability for hybrid automata, which generalizes the notion of observability. We propose a procedure to check diagnosability on a given hybrid automaton, and show that the complexity of the verification problem is in PTIME. We apply our procedure to an electromagnetic valve system for camless engines. This paper, because of space limitations, only summarizes the obtai...
متن کاملTime-Bounded Reachability for Initialized Hybrid Automata with Linear Differential Inclusions and Rectangular Constraints
Initialized hybrid automata with linear differential inclusions and rectangular constraints are hybrid automata where the invariants, guards, resets, and initial values are given by rectangular constraints, the flows are described by linear differential inclusions of the form ax+ b C1 ẋ C2 cx + d (with C1,C2 ∈ {<,≤}), and a variable x is reset on mode change whenever the differential inclusion ...
متن کاملDiscrete-Time Control for Rectangular Hybrid Automata
Rectangular hybrid automatamodel digital control programs of analog plant environments. We study rectangular hybrid automata where the plant state evolves continuously in real-numbered time, and the controller samples the plant state and changes the control state discretely, only at the integer points in time. We prove that rectangular hybrid automata have nite bisimilarity quotients when all c...
متن کاملHybrid Automata-Based CEGAR for Rectangular Hybrid Systems
In this paper we present a framework for carrying out counterexample guided abstraction-refinement (CEGAR) for systems modelled as rectangular hybrid automata. The main difference, between our approach and previous proposals for CEGAR for hybrid automata, is that we consider the abstractions to be hybrid automata as well. We show that the CEGAR scheme is semi-complete for the class of rectangul...
متن کاملGeneralized Robust Diagnosability of Discrete Event Systems
We address the problem of robust diagnosability of discrete event systems described by a class of automata, where each automaton in the class generates a distinct language. We introduce a new definition which generalizes all previous definitions of robust diagnosability; for this reason it is referred here to as generalized robust diagnosability. We also present a necessary and sufficient condi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009